package leecode

func missingTwo(nums []int) []int {
	hashMap := make(map[int]bool) //key为数组中的元素 , value为是否出现过
	for i := 0; i < len(nums); i++ {
		hashMap[nums[i]] = true
	}
	var result []int
	for i := 1; i <= len(nums)+2; i++ {
		if hashMap[i] {
			continue
		}
		result = append(result, i)
	}
	return result
}
